Refinements of Nash equilibrium in potential games
نویسندگان
چکیده
A strategic-form game is a potential game if the incentive of all players to change their strategy can be expressed in one global function, called the game’s potential. Potential games have many applications in Economics and other disciplines (cf. Rosenthal 1973, Monderer and Shapley 1996, Ostrovsky and Schwarz 2005, Armstrong and Vickers 2001, Myatt and Wallace 2009, inter alia). Potential games have a distinct computational advantage in that any maximizer of a potential is a pure-strategy Nash equilibrium. Therefore, the computation of an equilibrium is reduced to the solution of an optimization problem, thus obviating the need for computational fixed point theory. A Nash equilibrium need not maximize the potential function, so the set of maximizers provides a natural equilibrium selection device. Given the focus on the set of maximizers of a potential, it would be helpful to know if any maximizers are “robust” as Nash equilibria, and it is this issue that we study in this paper. Structurally, we work with games in which each player’s strategy set is a nonempty, compact metric space and for which there exists an upper semicontinuous potential. Consequently, we are working in a framework substantially more general than the case of finite strategy spaces, and the upper semicontinuity assumption adds extra flexibility in applications. Furthermore, the upper semicontinuity assumption allows us to use some basic machinery from variational analysis.1
منابع مشابه
Nash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملRegret Minimization in Behaviorally-Constrained Zero-Sum Games
No-regret learning has emerged as a powerful tool for solving extensive-form games. This was facilitated by the counterfactual-regret minimization (CFR) framework, which relies on the instantiation of regret minimizers for simplexes at each information set of the game. We use an instantiation of the CFR framework to develop algorithms for solving behaviorally-constrained (and, as a special case...
متن کاملStability and Equilibrium Selection in a Link Formation Game
In this paper we use a non cooperative equilibrium selection approach as a notion of stability in link formation games. Specifically, we follow the global games approach first introduced by Carlsson and van Damme (1993), to study the robustness of the set of Nash equilibria for a class of link formation games in strategic form with supermodular payoff functions. Interestingly, the equilibrium s...
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 an Experimental Analysis of Nash Refinements in Signaling Games
This paper investigates the refinements of Nash equilibrium in two person signaling game experiments. The experimental games cover the watershed of the nested refinements: Bayes-Nash, Sequential, Intutitive, Divine, Universally Divine, NWBR, and Stabel. In each game an equilbrium selection problem is defined in which adjacent refinements are considered. The pattern of outcomes suggest that indi...
متن کاملNew results on the verification of Nash refinements for extensive-form games
The computational study of strategic interaction situations has recently deserved a lot of attention in multi–agent systems. A number of results on strategic–form games and zero–sum extensive–form games are known in the literature, while general–sum extensive–form games are not studied in depth. We focus on the problem to decide whether or not a solution is a refinement of the Nash equilibrium ...
متن کامل